Some applications of graph theory in the theory of hypergraphs
نویسندگان
چکیده
منابع مشابه
the analysis of the role of the speech acts theory in translating and dubbing hollywood films
از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...
15 صفحه اولOn some applications of graph theory, I
In a series of papers, of which the present one is Part I, it is shown that solutions to a variety of problems in distance geoinetry, potential theory and theory of metric spaces arc provided by appropriate applications of graph theoretic results. §1 In what follows we are going to discuss systematic applications of graph theory-among others-to geometry, to potential theory, and to the theory o...
متن کاملOn Some Applications of Graph Theory Iii
1 . In the first and second parts of this sequence we dealt with applications of graph theory to distance distribution in certain sets in euclidean spaces, to potential theory, to estimations of the transfinite diameter [1] and to value distribution of "triangle functionals" (e.g. perimeter, area of triangles) [2] . The basic tool is provided in all these applications by the result formulated a...
متن کاملOn Some Applications of Graph Theory, II
For m = 2 we get the graphs. n is again the order of the m-graph; the meaning of m-subgraphs, complete m-graphs is obvious. We shall deal especially with the case m = 3, i.e. with the case of trigraphs, though the geometrical problems we are dealing with have natural analogues (and also problems of new type) for higher dimensions, and these involve m-graphs with general m’s, Let A,, A,, A, be t...
متن کاملSome Applications of Graph Theory to Numbers Theory
Let al <. .. < ak s n be a sequence of integers no one of which divides any other. It 1s not difficult to see that max k-[Et'-) [1]. Assume now that no a i divides the product of two others, then I proved that [2] (r(x) denotes the number of primes c x2/3 (1) n (x) +-l Z < max k (t .9 =) not exceeding x) x 2/3 < e(x) + c 2 (tog =) 2 The proof of both the upper and the lower bound used combinato...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1975
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-14-4-607-612